CMPSm : A Continuation Method for Polynomial Systems
نویسنده
چکیده
CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for cheater’s homotopy, but it can be also used for linear and polyhedral homotopies. The latest version CMPSm2 of this software, this manual and some numerical examples are available at http://www.is.titech.ac.jp/∼kojima/CMPSm/
منابع مشابه
Cmpsm : a Continuation Method for Polynomial Systems (matlab Version)
CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for the cheater's homotopy, but it can be also used for linear and polyhedral homotopies. The software CMPSm, this manual and some numerical examples are available at
متن کاملCmpsc : a Continuation Method for Polynomial Systems (c++ Version)
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کامل3 Cheater ’ s homotopy
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کاملA bootstrapping approach for computing multiple solutions of differential equations
Discretizing systems of nonlinear algebraic differential equations yield polynomial systems. When using a fine discretization, the resulting polynomial system is often too large to solve using a direct solving approach. Our approach for solving such systems is to utilize a homotopy continuation based method arising from domain decomposition. This method solves polynomial systems arising from su...
متن کاملA Special Homotopy Continuation Method for a Class of Polynomial Systems
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of this method is between the total degree bound and the mixed volume bound and can be easily computed. The new algorithm has been implemented as a program called ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002